Papers with bottom-up fashion
Discontinuous Constituency Parsing with a Stack-Free Transition System and a Dynamic Oracle (N19-1)
Copied to clipboard
| Challenge: | Discontinuous constituency trees are derivations of Linear Context-Free Rewriting Systems (LCFRS), which makes them much harder to parse. |
| Approach: | They propose a transition system that uses a set of parsing items with constant-time random access instead of storing subtrees in a stack . |
| Outcome: | The proposed system constructs a discontinuous constituency tree in 4n–2 transitions for a sentence of length n. |
TreeRare: Syntax Tree-Guided Retrieval and Reasoning for Knowledge-Intensive Question Answering (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing work shows that large language models generate incorrect statements due to over-reliance on parametric knowledge. |
| Approach: | They propose a framework that utilizes syntax trees to guide information retrieval and reasoning for question answering. |
| Outcome: | The proposed framework improves on existing state-of-the-art methods for large-scale query processing. |